skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Du, Shukai"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract With nested grids or related approaches, it is known that numerical artifacts can be generated at the interface of mesh refinement. Most of the existing methods of minimizing these artifacts are either problem‐dependent or numerical methods‐dependent. In this paper, we propose a universal predictor‐corrector approach to minimize these artifacts. By its construction, the approach can be applied to a wide class of models and numerical methods without modifying the existing methods but instead incorporating an additional step. The idea is to use an additional grid setup with a refinement interface at a different location, and then to correct the predicted state near the refinement interface by using information from the other grid setup. We give some analysis for our method in the setting of a one‐dimensional advection equation, showing that the key to the success of the method depends on an optimized way of choosing the weight functions, which determine the strength of the corrector at a certain location. Furthermore, the method is also tested in more general settings by numerical experiments, including shallow water equations, multi‐dimensional problems, and a variety of underlying numerical methods including finite difference/finite volume and spectral element. Numerical tests suggest the effectiveness of the method on reducing numerical artifacts due to mesh refinement. 
    more » « less
  2. Abstract The inverse problem for radiative transfer is important in many applications, such as optical tomography and remote sensing. Major challenges include large memory requirements and computational expense, which arise from high-dimensionality and the need for iterations in solving the inverse problem. Here, to alleviate these issues, we propose adaptive-mesh inversion: a goal-orientedhp-adaptive mesh refinement method for solving inverse radiative transfer problems. One novel aspect here is that the two optimizations (one for inversion, and one for mesh adaptivity) are treated simultaneously and blended together. By exploiting the connection between duality-based mesh adaptivity and adjoint-based inversion techniques, we propose a goal-oriented error estimator, which is cheap to compute, and can efficiently guide the mesh-refinement to numerically solve the inverse problem. We use discontinuous Galerkin spectral element methods to discretize the forward and the adjoint problems. Then, based on the goal-oriented error estimator, we propose anhp-adaptive algorithm to refine the meshes. Numerical experiments are presented at the end and show convergence speed-up and reduced memory occupation by the goal-oriented mesh adaptive method. 
    more » « less
  3. We provide a short introduction to the devising of a special type of methods for numerically approximating the solution of Hamiltonian partial differential equations. These methods use Galerkin space-discretizations which result in a system of ODEs displaying a discrete version of the Hamiltonian structure of the original system. The resulting system of ODEs is then discretized by a symplectic time-marching method. This combination results in high-order accurate, fully discrete methods which can preserve the invariants of the Hamiltonian defining the ODE system. We restrict our attention to linear Hamiltonian systems, as the main results can be obtained easily and directly, and are applicable to many Hamiltonian systems of practical interest including acoustics, elastodynamics, and electromagnetism. After a brief description of the Hamiltonian systems of our interest, we provide a brief introduction to symplectic time-marching methods for linear systems of ODEs which does not require any background on the subject. We describe then the case in which finite-difference space-discretizations are used and focus on the popular Yee scheme (1966) for electromagnetism. Finally, we consider the case of finite-element space discretizations. The emphasis is placed on the conservation properties of the fully discrete schemes. We end by describing ongoing work. 
    more » « less
  4. Abstract We present a new class of discontinuous Galerkin methods for the space discretization of the time-dependent Maxwell equations whose main feature is the use of time derivatives and/or time integrals in the stabilization part of their numerical traces.These numerical traces are chosen in such a way that the resulting semidiscrete schemes exactly conserve a discrete version of the energy.We introduce four model ways of achieving this and show that, when using the mid-point rule to march in time, the fully discrete schemes also conserve the discrete energy.Moreover, we propose a new three-step technique to devise fully discrete schemes of arbitrary order of accuracy which conserve the energy in time.The first step consists in transforming the semidiscrete scheme into a Hamiltonian dynamical system.The second step consists in applying a symplectic time-marching method to this dynamical system in order to guarantee that the resulting fully discrete method conserves the discrete energy in time.The third and last step consists in reversing the above-mentioned transformation to rewrite the fully discrete scheme in terms of the original variables. 
    more » « less
  5. null (Ed.)
    In this paper, we propose a simple way of constructing HDG+ projections on polyhedral elements. The projections enable us to analyze the Lehrenfeld–Schöberl HDG (HDG+) methods in a very concise manner, and make many existing analysis techniques of standard HDG methods reusable for HDG+. The novelty here is an alternative way of constructing the projections without using M M -decompositions as a middle step. This extends our previous results [S. Du and F.-J. Sayas, SpringerBriefs in Mathematics (2019)] (elliptic problems) and [S. Du and F.-J. Sayas, Math. Comp. 89 (2020), pp. 1745–1782] (elasticity) to polyhedral meshes. 
    more » « less
  6. Abstract We consider the problem of waves propagating in a viscoelastic solid. For the material properties of the solid we consider both classical and fractional differentiation in time versions of the Zener, Maxwell, and Voigt models, where the coupling of different models within the same solid are covered as well. Stability of each model is investigated in the Laplace domain, and these are then translated to time-domain estimates. With the use of semigroup theory, some time-domain results are also given which avoid using the Laplace transform and give sharper estimates. We take the time to develop and explain the theory necessary to understand the relation between the equations we solve in the Laplace domain and those in the time-domain which are written using the language of causal tempered distributions. Finally we offer some numerical experiments that highlight some of the differences between the models and how different parameters effect the results. 
    more » « less